Subwords in reverse-complement order
نویسندگان
چکیده
We examine finite words over an alphabet Γ = {
منابع مشابه
Subwords in reverse - complement order - Extended abstract ∗ Péter
We examine finite words over an alphabet Γ = {a, ā; b, b̄} of pairs of letters, where each word w1w2...wt is identified with its reverse complement w̄t...w̄2w̄1 (where ā = a, b̄ = b). We seek the smallest k such that every word of length n, composed from Γ, is uniquely ∗This work was supported, in part, by Hungarian NSF, under contract Nos. AT48826, NK62321, F043772, N34040, T34702, T37846, T43758, ...
متن کاملReconstruction from subwords ∗
In the paper two variants of a combinatorial problem for the set F n q of sequences of length n over the alphabet Fq = {0, 1, .., q − 1} are considered, with some applications. The original problem was the following: for a given word w ∈ F n q , what is the smallest integer k such that we can reconstruct w if we know all of its subwords of length k. This problem was solved by Lothaire [8] . We ...
متن کاملDNA-words and word posets
In the paper two variants of a combinatorial problem for the set F q of sequences of length n over the alphabet Fq = {0, 1, .., q − 1} are considered, with some applications. The original problem was the following: what is the smallest k such that every word v ∈ F q is uniquely determined by the set of its subwords of length up to k. This problem was solved by Lothaire [1]. We consider the foll...
متن کاملSearch Space Reduction for Farsi Printed Subwords Recognition by Position of the Points and Signs
In the field of the words recognition, three approaches of words isolation, the overall shape and combination of them are used. Most optical recognition methods recognize the word based on break the word into its letters and then recogniz them. This approach is faced some problems because of the letters isolation dificulties and its recognition accurcy in texts with a low image quality. Therefo...
متن کاملCharacterization of a word by its subwords
We consider what is the amount of subwords of a word needed to completely determine the word. More precisely, we study the maximal length such that all words of this length can be uniquely determined by its subwords of a xed length. The set of subwords of a xed length is called a spectrum. Four types of spectrums are analyzed: sparse, factor, sparse with multiplicity and factor with multiplicit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006